A Comparison of the SNLP and TWEAK Planning Algorithms
نویسندگان
چکیده
Most current partial-order planning systems are based on either the TWEAK or SNLP planning algorithms. Both planning algorithms are complete and correct. The SNLP algorithm distinguishes itself from TWEAK in that it is also systematic, so it never generates redundant plans in its search space. This paper compares the two planning algorithms and shows that SNLP’S systematicity property does not imply that the planner is more efficient than TWEAK. To compare the two systems, we review the SNLP algorithm and describe how it can be easily transformed into TWEAK. Then we present a complexity analysis of each system and identify the factors that determine the performance of the systems. Finally, we present results on a set of classic planning problems, which show that the relative performance of the two systems depends on the characteristics of the problems being solved.
منابع مشابه
Causal Links Planning and the Systematic Approach to Action and Change
This paper presents an analysis of partial-order and causal-links planning based on Sandewall’s systematic approach to reasoning about action and change. The partial-order planners TWEAK and SNLP are analysed and reconstructed. A temporal logic, called the fluent logic, is used for representing plans, and the strong connection between causal links and elements of the fluent logic are pointed out.
متن کاملEvaluating the Tradeo s in Partial-Order Planning Algorithms
Most practical partial-order planning systems employ some form of goal protection. However, it is not clear from previous work what the tradeo s are between the di erent goalprotection strategies. Is it better to protect against all threats to a subgoal, some threats, or no threats at all? In this paper, we consider three well-known planning algorithms, snlp, nonlin, and tweak. Each algorithm m...
متن کاملOn the Implenentation and Evaluation of ABTWEAK
In this paper we describe the implementation and evaluation of the AbTweak planning system, a test bed for studying and teaching concepts in partial-order planning, abstraction, and search control. We start by extending the hierarchical, precondition-elimination abstraction of Abstrips to partial-order-based, least-commitment planners such as Tweak. The resulting system, AbTweak, is used to ill...
متن کاملReasoning about Multiple Plans in Dynamic Multi - agent Domains ( Extended
Classical planning algorithms such as TWEAK (Chapman, 1987) or SNLP (McAllester and Rosenblitt 1991) were developed to solve relatively simple problems in static, single-agent environments. Remarkably, recent applications have demonstrated that this basic technique, with modest extensions, can plan for large-scale, dynamic, multi-agent environments such as intelligent tutoring (Rickel and Johns...
متن کاملReasoning about Multiple Plans in Dynamic Multi-agent Domains
Classical planning algorithms such as TWEAK (Chapman, 1987) or SNLP (McAllester and Rosenblitt 1991) were developed to solve relatively simple problems in static, single-agent environments. Remarkably, recent applications have demonstrated that this basic technique, with modest extensions, can plan for large-scale, dynamic, multi-agent environments such as intelligent tutoring (Rickel and Johns...
متن کامل